Directed Moore Hypergraphs
نویسندگان
چکیده
For graphs with maximum degree A and diameter D, an upper bound on the number of vertices is 1 + AxF:-,‘(A 1)‘. This bound is called the Moore bound for graphs and the graphs that attain it are called Moore graphs. Similar bounds for directed graphs and for hypergraphs have been defined and the existence of directed Moore graphs and of Moore hypergraphs has been studied. In this article, we define a Moore bound for directed hypergraphs and show that directed Moore hypergraphs either are directed cycles, or have diameter one. Any directed hypergraph may be regarded as a factorization of a square nonnegative integer matrix into a pair of (0, 1)-matrices. In particular, the directed Moore hypergraphs of diameter 1 that have n vertices and m hyperarcs can be identified with factorizations J I = XY where J is the n x n all-ones matrix, I is the n x n identity matrix, X is an n x m (0, 1)-matrix, Y is an m x n (0, 1)-matrix, and X and Y have constant row sums. We conclude with a survey of results on factorizations of
منابع مشابه
Directed domination in oriented hypergraphs
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
متن کاملCertain networks models using single-valued neutrosophic directed hypergraphs
A directed hypergraph is powerful tool to solve the problems that arises in different fields, including computer networks, social networks and collaboration networks. In this research paper, we apply the concept of single-valued neutrosophic sets to directed hypergraphs. We introduce certain new concepts, including single-valued neutrosophic directed hypergraphs, single-valued neutrosophic line...
متن کاملPartial line directed hypergraphs
The partial line digraph technique was introduced in [7] in order to construct digraphs with a minimum diameter, maximum connectivity, and good expandability. To find a new method to construct directed hypergraphs with a minimum diameter, we present in this paper an adaptation of that technique to directed hypergraphs. Directed hypergraphs are used as models for interconnection networks whose v...
متن کاملEnumeration of Unlabeled Directed Hypergraphs
We consider the enumeration of unlabeled directed hypergraphs by using Pólya’s counting theory and Burnside’s counting lemma. Instead of characterizing the cycle index of the permutation group acting on the hyperarc set A, we treat each cycle in the disjoint cycle decomposition of a permutation ρ acting on A as an equivalence class (or orbit) of A under the operation of the group generated by ρ...
متن کاملA new decision-making method based on bipolar neutrosophic directed hypergraphs
Directed hypergraphs are widely used as a tool to solve andmodel the problems appearing in computer science and operations research. Bipolar neutrosophic models are more flexible and applicable because these models study neutrosophic behavior positively as well as negatively. In this research study, we present a new frame work for handling bipolar neutrosophic information by combining the bipol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 63 شماره
صفحات -
تاریخ انتشار 1995